Conditional Posterior Cramér-Rao lower bounds for nonlinear recursive filtering
نویسندگان
چکیده
Posterior Cramér Rao lower bounds (PCRLBs) [1] for sequential Bayesian estimators provide performance bounds for general nonlinear filtering problems and have been used widely for sensor management in tracking and fusion systems. However, the unconditional PCRLB [1] is an off-line bound that is obtained by taking the expectation of the Fisher information matrix (FIM) with respect to the measurement and the state to be estimated. In this paper, we introduce a new concept of conditional PCRLB, which is dependent on the observation data up to the current time, and adaptive to a particular realization of the system state. Therefore, it is expected to provide a more accurate and effective performance evaluation than the conventional unconditional PCRLB. However, analytical computation of this new bound is, in general, intractable except when the system is linear and Gaussian. In this paper, we present a sequential Monte Carlo solution to compute the conditional PCRLB for nonlinear non-Gaussian sequential Bayesian estimation problems.
منابع مشابه
Posterior Cramer-Rao bounds for discrete-time nonlinear filtering
A mean-square error lower bound for the discretetime nonlinear filtering problem is derived based on the Van Trees (posterior) version of the Cramér–Rao inequality. This lower bound is applicable to multidimensional nonlinear, possibly non-Gaussian, dynamical systems and is more general than the previous bounds in the literature. The case of singular conditional distribution of the one-step-ahe...
متن کاملNew Conditional Posterior Cramér-Rao Lower Bounds for Nonlinear Sequential Bayesian Estimation
The recursive procedure to compute the posterior Cramér-Rao lower bound (PCRLB) for sequential Bayesian estimators, derived by Tichavsky et al., provides an off-line performance bound for a general nonlinear filtering problem. Since the corresponding Fisher information matrix (FIM) is obtained by taking the expectation with respect to all the random variables, this PCRLB is not well suited for ...
متن کاملConditional Posterior Cramér-Rao Lower Bounds for Nonlinear Sequential Bayesian Estimation
Posterior Cramér-Rao lower bounds (PCRLBs) [1] for sequential Bayesian estimators provide a performance bound for a general nonlinear filtering problem. However, the unconditional PCRLB [1] is an off-line bound whose corresponding Fisher information matrix (FIM) is obtained by taking the expectation with respect to all the random variables, namely the measurements and the system states. As a re...
متن کاملA fresh look at Bayesian Cramér-Rao bounds for discrete-time nonlinear filtering
In this paper, we aim to relate different Bayesian Cramér-Rao bounds which appear in the discrete-time nonlinear filtering literature in a single framework. A comparative theoretical analysis of the bounds is provided in order to relate their tightness. The results can be used to provide a lower bound on the mean square error in nonlinear filtering. The findings are illustrated and verified by ...
متن کاملCramér-Rao Bounds for Non-Linear Filtering with Measurement Origin Uncertainty
We are concerned with the problem of tracking a single target using multiple sensors. At each stage the measurement number is uncertain and measurements can either be target generated or false alarms. The CramérRao bound gives a lower bound on the performance of any unbiased estimator of the target state. In this paper we build on earlier research concerned with calculating Posterior Cramér-R...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009